Searching a Solid Pseudo 3-Sided Orthoconvex Grid
نویسندگان
چکیده
Abs t rac t . In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We obtain a closed formula that expresses the minimum number of searchers required to search a pseudo 3-sided solid orthoconvex grid. From that formula and a rather straight forward algorithm we show that the problem is in P. We obtain a parallel version of that algorithm that places the problem in NC. For the case of sequential algorithms, we derive an optimal algorithm that solves the problem in O(m) time where ra is the number of points necessary to describe the orthoconvex grid. Another important feature of our method is that it also suggests an optimal searching strategy that consists of O(n) steps, where n is the number of nodes of the grid.
منابع مشابه
Treemaps with Bounded Aspect Ratio
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap for T is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of T and its area is proportional to the weight of the corresponding node. An important ...
متن کاملD0 Silicon Microstrip Tracker for Run Iia
One main improvement included in the D0 detector upgrade 1 for Run IIa is its central tracking system as shown in Fig. 1. It includes a 2 T superconducting solenoid, a Central scintillating Fiber Tracker (CFT) and the SMT. The SMT design is driven by two classes of events. Barrels and central disks cover the ∼ 25 cm RMS long luminous region for high pT central physics (|η| < 1.5). Forward disks...
متن کاملSolid Pseudo-Papillary Tumor of the Pancreas in a 10 year old girl
Abstract Background Solid pseudo-papillary tumor of the pancreas (SPTP) is a rare disease with a low malignant potential. Though it shows low malignant potential 10% to 15% of the cases show aggressive behavior with metastatic involvement of the liver. The symptoms include abdominal discomfort and abdominal pain. It is very rare in early years of age. This is the case of a 10 year old girl wi...
متن کاملRecognition of Largest Empty Orthoconvex Polygon in a Point Set
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space complexities of the proposed algorithm are O(n) and O(n) respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992